The multi-vehicle profitable pickup and delivery problem
نویسندگان
چکیده
منابع مشابه
A Multi-Vehicle Profitable pickup and Delivery Selection Problem with Time Windows
Today the transportation market is highly competitive yet asymmetric. Large carriers enjoy market power from economies of scale and better networking. Small carriers rely on horizontal cooperation between each other to compete with, usually by trading on freight exchanges. One major challenge for small carriers is how to select requests so that the total profit from the delivery can be maximize...
متن کاملThe Pickup and Delivery Multi-depot Vehicle Routing Problem
We address in this paper the pickup and delivery multi-depot vehicle routing problem (PDMDVRP). In this problem, a single commodity type is collected from a set of pickup customers to be delivered to a set of delivery customers by vehicles dispatched from multiple depots. The proposed problem has many applications in practice such as distribution of money between the branches of a bank, and mov...
متن کاملThe fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery: Formulation and a heuristic algorithm
In this paper, the fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery (FMDVRP-SPD) is investigated. The FMDVRP-SPD is the problem of allocating customers to several depots, so that the optimal set of routes is determined simultaneously to serve the pickup and the delivery demands of each customer within scattered depots. In the problem, both pickup and delivery dema...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملModels for the single-vehicle preemptive pickup and delivery problem
In this paper, we study a variant of the well-known single-vehicle pickup and delivery problem where the demands can be unloaded/reloaded at any node. By proving new complexity results, we give the minimum information which is necessary to represent feasible solutions. Using this, we present integer linear programs for both the unitary and the general versions. We then show that the associated ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: OR Spectrum
سال: 2016
ISSN: 0171-6468,1436-6304
DOI: 10.1007/s00291-016-0454-y